Solving the graph-isomorphism problem with a quantum annealer
نویسندگان
چکیده
منابع مشابه
The Direct Algorithm for Solving of the Graph Isomorphism Problem
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
متن کاملSolving Graph Isomorphism Problem for a Special case
Graph isomorphism is an important computer science problem. The problem for the general case is unknown to be in polynomial time. The bese algorithm for the general case works in quasi-polynomial time [1]. The solutions in polynomial time for some special type of classes are known. In this work, we have worked with a special type of graphs. We have proposed a method to represent these graphs an...
متن کاملA Quantum Observable for the Graph Isomorphism Problem
Suppose we are given two graphs on n vertices. We define an observable in the Hilbert space C[(Sn ≀ S2)m] which returns the answer “yes” with certainty if the graphs are isomorphic and “no” with probability at least 1 − n! 2 if the graphs are not isomorphic. We do not know if this observable is efficiently implementable.
متن کاملThe Graph Isomorphism Problem
The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2012
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.86.042310